| 翻訳と辞書 |
| Complement (graph theory) ： ウィキペディア英語版 |
Complement graph
In graph theory, the complement or inverse of a graph ''G'' is a graph ''H'' on the same vertices such that two distinct vertices of ''H'' are adjacent if and only if they are not adjacent in ''G''. That is, to generate the complement of a graph, one fills in all the missing edges required to form a complete graph, and removes all the edges that were previously there. It is not, however, the set complement of the graph; only the edges are complemented.
==Formal construction==
Let ''G'' = (''V'', ''E'') be a simple graph and let ''K'' consist of all 2-element subsets of ''V''. Then ''H'' = (''V'', ''K'' \ ''E'') is the complement of ''G''.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Complement graph」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|